Strong Normalization of Classical Natural Deduction with Disjunction
نویسنده
چکیده
We introduce λμ→∧∨⊥, an extension of Parigot’s λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λμ→∧∨⊥ may be seen as the core of a typed cbn functional language featuring product, coproduct, and control operators.
منابع مشابه
Strong normalization of classical natural deduction with disjunctions
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conjunction, and their permutative conversions. This paper also proves natural deduction can be embedd...
متن کاملA short proof of the strong normalization of classical natural deduction with disjunction
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
متن کاملStrong normalization results by translation
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed λμ-calculus. We also extend Mendler’s result on recursive equations to this system.
متن کاملA note on strong normalization in classical natural deduction
In the context of natural deduction for propositional classical logic, with classicality given by the inference rule reductio ad absurdum, we investigate the De Morgan translation of disjunction in terms of negation and conjunction. Once the translation is extended to proofs, it obtains a reduction of provability to provability in the disjunction-free subsystem. It is natural to ask whether a r...
متن کاملConfluency property of the call-by-value λμ-calculus
Gentzen (1955) introduced the natural deduction system to study the notion of proof. The full classical natural deduction system is well adapted for the human reasoning. By full we mean that all the connectives (→, ∧ and ∨) and ⊥ (for the absurdity) are considered as primitive. As usual, the negation is defined by ¬A = A → ⊥. Considering this logic from the computer science of view is interesti...
متن کامل